Supereulerian graphs, independent sets, and degree-sum conditions
نویسندگان
چکیده
منابع مشابه
Degree sequence and supereulerian graphs
A sequence d = (d1, d2, · · · , dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is linehamiltonian if d has a realizationG such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph. In this paper, it is proved that a nonincreasing graphic sequence d = (d...
متن کاملMultigraphic degree sequences and supereulerian graphs, disjoint spanning trees
A sequence d = (d1, d2, . . . , dn) is multigraphic if there is a multigraph G with degree sequence d, and such a graph G is called a realization of d. In this paper, we prove that a nonincreasing multigraphic sequence d = (d1, d2, . . . , dn) has a realization with a spanning eulerian subgraph if and only if either n = 1 and d1 = 0, or n ≥ 2 and dn ≥ 2, and that d has a realization G such that...
متن کاملSupereulerian graphs and matchings
A graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α(G) be the maximum number of independent edges in the graph G. In this paper, we show that if G is a 2-edge-connected simple graph and α(G) ≤ 2, then G is supereulerian if and only if G is not K2,t for some odd number t . © 2011 Elsevier Ltd. All rights reserved.
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملGreedy Approximations of Independent Sets in Low Degree Graphs
We investigate the power of a family of greedy algorithms for the independent set problem in cubic graphs and graphs of maximum degree three. These algorithm iteratively select vertices of minimum degree, but diier in the secondary rule for choosing among many candidates. We study three such algorithms, and prove tight performance ratios, with the best one being 9=7 1:28. All of these algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00028-9